Complete parameterization of piecewise-polynomial interpolation kernels
نویسندگان
چکیده
Every now and then, a new design of an interpolation kernel appears in the literature. While interesting results have emerged, the traditional design methodology proves laborious and is riddled with very large systems of linear equations that must be solved analytically. We propose to ease this burden by providing an explicit formula that can generate every possible piecewise-polynomial kernel given its degree, its support, its regularity, and its order of approximation. This formula contains a set of coefficients that can be chosen freely and do not interfere with the four main design parameters; it is thus easy to tune the design to achieve any additional constraints that the designer may care for.
منابع مشابه
gH-differentiable of the 2th-order functions interpolating
Fuzzy Hermite interpolation of 5th degree generalizes Lagrange interpolation by fitting a polynomial to a function f that not only interpolates f at each knot but also interpolates two number of consecutive Generalized Hukuhara derivatives of f at each knot. The provided solution for the 5th degree fuzzy Hermite interpolation problem in this paper is based on cardinal basis functions linear com...
متن کاملPredicting the Efficiency of Decision-Making Unit by Using Piecewise Polynomial Extrapolation in Different Times
In this article, we will estimate efficiency amountof decision-making unit by offering the continuous piecewise polynomialextrapolation and interpolation by CCR model input-oriented on the assumptionthat it is constant returns to scale in different times. And finally, we willestimate efficiency amount of decision-making unit indifferent times byoffering an example.
متن کاملImage Reconstruction by Convolution with Symmetrical Piecewise th-Order Polynomial Kernels
The reconstruction of images is an important operation in many applications. From sampling theory, it is well known that the sinc-function is the ideal interpolation kernel which, however, cannot be used in practice. In order to be able to obtain an acceptable reconstruction, both in terms of computational speed and mathematical precision, it is required to design a kernel that is of finite ext...
متن کاملImage reconstruction by convolution with symmetrical piecewise nth-order polynomial kernels
The reconstruction of images is an important operation in many applications. From sampling theory, it is well known that the sine-function is the ideal interpolation kernel which, however, cannot be used in practice. In order to be able to obtain an acceptable reconstruction, both in terms of computational speed and mathematical precision, it is required to design a kernel that is of finite ext...
متن کاملPiecewise Polynomial Kernels for Image Interpolation: A Generalization of Cubic Convolution
A well-known approach to image interpolation is cubic convolution, in which the ideal sinc function is modelled by a finite extent kernel, which consists of piecewise third order polynomials. In this paper we show that the concept of cubic convolution can be generalized. We derive kernels of up to ninth order and compare them both mutually and to cardinal splines of corresponding orders. From s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
دوره 12 11 شماره
صفحات -
تاریخ انتشار 2003